Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

implies2(not1(x), y) -> or2(x, y)
implies2(not1(x), or2(y, z)) -> implies2(y, or2(x, z))
implies2(x, or2(y, z)) -> or2(y, implies2(x, z))

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

implies2(not1(x), y) -> or2(x, y)
implies2(not1(x), or2(y, z)) -> implies2(y, or2(x, z))
implies2(x, or2(y, z)) -> or2(y, implies2(x, z))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

IMPLIES2(x, or2(y, z)) -> IMPLIES2(x, z)
IMPLIES2(not1(x), or2(y, z)) -> IMPLIES2(y, or2(x, z))

The TRS R consists of the following rules:

implies2(not1(x), y) -> or2(x, y)
implies2(not1(x), or2(y, z)) -> implies2(y, or2(x, z))
implies2(x, or2(y, z)) -> or2(y, implies2(x, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

IMPLIES2(x, or2(y, z)) -> IMPLIES2(x, z)
IMPLIES2(not1(x), or2(y, z)) -> IMPLIES2(y, or2(x, z))

The TRS R consists of the following rules:

implies2(not1(x), y) -> or2(x, y)
implies2(not1(x), or2(y, z)) -> implies2(y, or2(x, z))
implies2(x, or2(y, z)) -> or2(y, implies2(x, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


IMPLIES2(x, or2(y, z)) -> IMPLIES2(x, z)
The remaining pairs can at least be oriented weakly.

IMPLIES2(not1(x), or2(y, z)) -> IMPLIES2(y, or2(x, z))
Used ordering: Polynomial interpretation [21]:

POL(IMPLIES2(x1, x2)) = x2   
POL(not1(x1)) = 0   
POL(or2(x1, x2)) = 1 + x2   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ QDPOrderProof
        ↳ QDP
          ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

IMPLIES2(not1(x), or2(y, z)) -> IMPLIES2(y, or2(x, z))

The TRS R consists of the following rules:

implies2(not1(x), y) -> or2(x, y)
implies2(not1(x), or2(y, z)) -> implies2(y, or2(x, z))
implies2(x, or2(y, z)) -> or2(y, implies2(x, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


IMPLIES2(not1(x), or2(y, z)) -> IMPLIES2(y, or2(x, z))
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(IMPLIES2(x1, x2)) = x1 + x2   
POL(not1(x1)) = 1 + x1   
POL(or2(x1, x2)) = x1   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ QDPOrderProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

implies2(not1(x), y) -> or2(x, y)
implies2(not1(x), or2(y, z)) -> implies2(y, or2(x, z))
implies2(x, or2(y, z)) -> or2(y, implies2(x, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.